HOW OFTEN IS A POLYGON BOUNDED BY THREE SIDES.ENTRINGER RC; PURDY GB.1982; ISR. J. MATH.; ISSN 0021-2172; ISR; DA. 1982; VOL. 43; NO 1; PP. 23-27; BIBL. 1 REF.Article

A NOTE ON K-CRITICALLY N-CONNECTED GRAPHS.ENTRINGER RC; SLATER PJ.1977; PROC. AMER. MATH. SOC.; U.S.A.; DA. 1977; VOL. 66; NO 2; PP. 372-375; BIBL. 5 REF.Article

SPANNING CYCLES OF NEARLY CUBIC GRAPHSENTRINGER RC; SWART H.1980; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1980; VOL. 29; NO 3; PP. 303-309; BIBL. 8 REF.Article

ON THE NUMBER OF UNIQUE SUBGRAPHS OF A GRAPHENTRINGER RC; ERDOS P.1972; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1972; VOL. 13; NO 2; PP. 112-115Serial Issue

ARC COLORINGS OF DIGRAPHSHARNER CC; ENTRINGER RC.1972; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1972; VOL. 13; NO 3; PP. 219-225; BIBL. 4 REF.Serial Issue

GOSSIPS AND TELEGRAPHSENTRINGER RC; SLATER PJ.1979; J. FRANKLIN INST.; USA; DA. 1979; VOL. 307; NO 6; PP. 353-360; BIBL. 10 REF.Article

A SUFFICIENT CONDITION FOR EQUALITY OF EDGE CONNECTIVITY AND MINIMUM DEGREE OF A GRAPHGOLDSMITH DL; ENTRINGER RC.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 3; PP. 251-255; BIBL. 4 REF.Article

SOME PROPERTIES OF COMPONENTS OF BIGRAPHSSIMMONS GJ; ENTRINGER RC.1973; PERIOD. MATH. HUNGAR.; HONGR.; DA. 1973; VOL. 3; NO 1-2; PP. 167-174; BIBL. 2 REF.Serial Issue

SUMS OF VALENCES IN BIGRAPHSENTRINGER RC; SIMMONS GJ.1973; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1973; VOL. 14; NO 1; PP. 93-101; BIBL. 1 REF.Serial Issue

DETOURS IN DIGRAPHSENTRINGER RC; JACKSON DE; SWART E et al.1981; SOUTHEASTERN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND COMPUTING. 12/1981/LOUISIANA STATE UNIVERSITY LA; CAN; WINNIPEG: UTILITAS MATHEMATICA PUBLISHING; DA. 1981; PP. 305-321; BIBL. 5 REF.Conference Paper

MINIMUM GRAPHS WITH COMPLETE K-CLOSURECLARK L; ENTRINGER RC; JACKSON DE et al.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 30; NO 2; PP. 95-101; BIBL. 6 REF.Article